翻訳と辞書 Words near each other ・ Table of precedence for the People's Republic of Bangladesh ・ Table of precedence of Negeri Sembilan ・ Table of precedence of Perak ・ Table of precedence of Sabah ・ Table of precedence of Sarawak ・ Table of prime factors ・ Table of prophets of Abrahamic religions ・ Table of Ranks ・ Table of simple cubic graphs ・ Table of spherical harmonics ・ Table of standard reduction potentials for half-reactions important in biochemistry ・ Table of stars with Bayer designations ・ Table of stars with Flamsteed designations ・ Table of Teenage Mutant Ninja Turtles character appearances ・ Table of the Elements ・ Table of the largest known graphs of a given diameter and maximal degree ・ Table of thermodynamic equations ・ Table of vertex-symmetric digraphs ・ Table of volume of distribution for drugs ・ Table of voting systems by country ・ Table of vowels ・ Table of World Heritage Sites by country ・ Table of years in archaeology ・ Table of years in architecture ・ Table of years in art ・ Table of years in British radio ・ Table of years in British television ・ Table of years in comics ・ Table of years in country music ・ Table of years in film Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Table of the largest known graphs of a given diameter and maximal degree ： ウィキペディア英語版 Table of the largest known graphs of a given diameter and maximal degree In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem (excluding the case of degree 2, where the largest graphs are cycles with an odd number of vertices). ==Table of the orders of the largest known graphs for the undirected degree diameter problem== Below is the table of the vertex numbers for the best-known graphs (as of October 2008) in the undirected degree diameter problem for graphs of degree at most 3 ≤ ''d'' ≤ 16 and diameter 2 ≤ ''k'' ≤ 10. Only a few of the graphs in this table (marked in bold) are known to be optimal (that is, largest possible). The remainder are merely the largest so far discovered, and thus finding a larger graph that is closer in order (in terms of the size of the vertex set) to the Moore bound is considered an open problem. Some general constructions are known for values of ''d'' and ''k'' outside the range shown in the table. The following table is the key to the colors in the table presented above: 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Table of the largest known graphs of a given diameter and maximal degree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.